Bottom Up Information Propagation for

نویسنده

  • Wim Vanhoof
چکیده

Traditional top down specialisation techniques are not optimal to spe-cialise programs containing a lot of internal structure handling, such as programs containing abstract data types or meta programs. In this abstract , we discuss the diiculties top down specialisers have when special-ising these kinds of programs. The diiculties arise from the fact that unfolding works in a top down way, whereas some information ows in a bottom up way. Therefore, top down techniques must be able to unfold deeply enough to reach the necessary information, and subsequently be able to keep it during specialisation. We therefore propose a program transformation phase, targeted to be interleaved with a completely general and fully automatic top down partial deduction scheme, which consists of propagating such structural information into a program P in a bottom up way, thereby making the use of structure more explicit in the program, resulting in a new program P 0. We then argue that using P 0 instead of P during top down unfolding ooers many advantages for the quality of the specialised program, as well as for the eeciency of the specialiser.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Effect of Water Surface and Sea Bottom on Sound Propagation in Persian Gulf

Whether exploratory or commercially, acoustic fishery benefits are important in finding a school of fish and other aquatics, but using this procedure and state accurate detailed information for the whole specifications of organisms require sufficient information of sound speed changes, course of ray propagation and their rate of  absorption and attenuation . This research has considered the qua...

متن کامل

Constraint Propagation vs Syntactical

This paper describes a constraint propagation method for logical structure extraction of Library references without the use of ocr. The accent is put on the search of anchor points from visual indices extraction. A mixed strategy is performed. For each anchor points. the system proposes in a bottom-up manner the most probable model hypothesis and tries to verify in a top-down manner its left an...

متن کامل

The Effect of Bottom-up/Top- down Techniques on Lower vs. Upper -Intermediate EFL Learners’ Listening Comprehension

Listening is regarded as an interactive process involving decoding of information. This study was launched to find out the impact of bottom-up (BU) and top-down (TD) techniques on Iranian lower and upper intermediate learners’ listening comprehension. We selected a total of 120 participants in six intact classes, three lower intermediate and three upper intermediate. The proficiency level of th...

متن کامل

Recursive Context Propagation Network for Semantic Scene Labeling

We propose a deep feed-forward neural network architecture for pixel-wise semantic scene labeling. It uses a novel recursive neural network architecture for context propagation, referred to as rCPN. It first maps the local visual features into a semantic space followed by a bottom-up aggregation of local information into a global representation of the entire image. Then a top-down propagation o...

متن کامل

Tracking multiple targets via Particle Based Belief Propagation

Tracking multiple visual targets involving occlusion and varying number problems is a challenging problem in computer vision. This paper presents a summary of recent works on multiple targets tracking (MTT) in video done by a research group of Institute of Artificial Intelligence and Robotics, XJTU. The summary is given in two parts. The first part presents their work on modelling interactions ...

متن کامل

Scene Grammars, Factor Graphs, and Belief Propagation

We consider a class of probabilistic grammars for generating scenes with multiple objects. Probabilistic scene grammars capture relationships between objects using compositional rules that provide important contextual cues for inference with ambiguous data. We show how to represent the distribution defined by a probabilistic scene grammar using a factor graph. We also show how to efficiently pe...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997